Interval representations of planar graphs
نویسندگان
چکیده
منابع مشابه
Primal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a represen...
متن کاملOn Visibility Representations of Non-Planar Graphs
A rectangle visibility representation (RVR) of a graph consists of an assignment of axisaligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight between the rectangles assigned to its endpoints. Testing whether a graph has an RVR is known to be NP-hard. In this paper, we study the problem of finding an RVR under the assumption that an embedding...
متن کاملDot Product Representations of Planar Graphs
A graph G is a k-dot product graph if there exists a vector labelling u : V (G)→ Rk such that u(i)Tu(j) ≥ 1 if and only if ij ∈ E(G). Fiduccia, Scheinerman, Trenk and Zito [4] asked whether every planar graph is a 3-dot product graph. We show that the answer is “no”. On the other hand, every planar graph is a 4-dot product graph. We also answer the corresponding questions for planar graphs of p...
متن کاملEdge-Weighted Contact Representations of Planar Graphs
We study contact representations of edge-weighted planar graphs, where vertices are rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent the edge weights. We show that for any given edge-weighted planar graph whose outer face is a quadrangle, that is internally triangulated and that has no separating triangles we can construct in linear time an edge-proporti...
متن کامل3D Visibility Representations of 1-planar Graphs
We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed z-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1986
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90061-4